TSTP Solution File: ITP159^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP159^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:10 EDT 2024
% Result : Theorem 0.38s 0.63s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 21 ( 12 unt; 9 typ; 0 def)
% Number of atoms : 12 ( 3 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 34 ( 4 ~; 0 |; 0 &; 30 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 6 ( 0 ^ 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
refine424419629nres_a: $tType ).
thf(decl_sort2,type,
refine432681134nres_b: $tType ).
thf(decl_sort3,type,
set_Product_prod_a_b: $tType ).
thf(decl_34,type,
ord_le519537037nres_a: refine424419629nres_a > refine424419629nres_a > $o ).
thf(decl_47,type,
top_to231829469nres_a: refine424419629nres_a ).
thf(decl_48,type,
top_to240090974nres_b: refine432681134nres_b ).
thf(decl_72,type,
refine1441824854un_a_b: set_Product_prod_a_b > refine432681134nres_b > refine424419629nres_a ).
thf(decl_91,type,
r: set_Product_prod_a_b ).
thf(decl_92,type,
x: refine424419629nres_a ).
thf(conj_0,conjecture,
ord_le519537037nres_a @ x @ ( refine1441824854un_a_b @ r @ top_to240090974nres_b ),
file('/export/starexec/sandbox/tmp/tmp.agOxWtJg4S/E---3.1_9534.p',conj_0) ).
thf(fact_29_conc__fun__FAIL,axiom,
! [X41: set_Product_prod_a_b] :
( ( refine1441824854un_a_b @ X41 @ top_to240090974nres_b )
= top_to231829469nres_a ),
file('/export/starexec/sandbox/tmp/tmp.agOxWtJg4S/E---3.1_9534.p',fact_29_conc__fun__FAIL) ).
thf(fact_32_nres__order__simps_I3_J,axiom,
! [X43: refine424419629nres_a] : ( ord_le519537037nres_a @ X43 @ top_to231829469nres_a ),
file('/export/starexec/sandbox/tmp/tmp.agOxWtJg4S/E---3.1_9534.p',fact_32_nres__order__simps_I3_J) ).
thf(c_0_3,negated_conjecture,
~ ( ord_le519537037nres_a @ x @ ( refine1441824854un_a_b @ r @ top_to240090974nres_b ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_4,negated_conjecture,
~ ( ord_le519537037nres_a @ x @ ( refine1441824854un_a_b @ r @ top_to240090974nres_b ) ),
inference(fof_nnf,[status(thm)],[c_0_3]) ).
thf(c_0_5,plain,
! [X1195: set_Product_prod_a_b] :
( ( refine1441824854un_a_b @ X1195 @ top_to240090974nres_b )
= top_to231829469nres_a ),
inference(variable_rename,[status(thm)],[fact_29_conc__fun__FAIL]) ).
thf(c_0_6,negated_conjecture,
~ ( ord_le519537037nres_a @ x @ ( refine1441824854un_a_b @ r @ top_to240090974nres_b ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X18: set_Product_prod_a_b] :
( ( refine1441824854un_a_b @ X18 @ top_to240090974nres_b )
= top_to231829469nres_a ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1218: refine424419629nres_a] : ( ord_le519537037nres_a @ X1218 @ top_to231829469nres_a ),
inference(variable_rename,[status(thm)],[fact_32_nres__order__simps_I3_J]) ).
thf(c_0_9,negated_conjecture,
~ ( ord_le519537037nres_a @ x @ top_to231829469nres_a ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_10,plain,
! [X3: refine424419629nres_a] : ( ord_le519537037nres_a @ X3 @ top_to231829469nres_a ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.17 % Problem : ITP159^1 : TPTP v8.1.2. Released v7.5.0.
% 0.18/0.19 % Command : run_E %s %d THM
% 0.19/0.40 % Computer : n011.cluster.edu
% 0.19/0.40 % Model : x86_64 x86_64
% 0.19/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.40 % Memory : 8042.1875MB
% 0.19/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.40 % CPULimit : 300
% 0.19/0.40 % WCLimit : 300
% 0.19/0.40 % DateTime : Fri May 3 12:43:49 EDT 2024
% 0.19/0.40 % CPUTime :
% 0.38/0.59 Running higher-order theorem proving
% 0.38/0.59 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.agOxWtJg4S/E---3.1_9534.p
% 0.38/0.63 # Version: 3.1.0-ho
% 0.38/0.63 # Preprocessing class: HSLSSMSMSSSCHFA.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting lpo5_fix with 1500s (5) cores
% 0.38/0.63 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.38/0.63 # Starting post_as_ho8 with 300s (1) cores
% 0.38/0.63 # Starting lpo5_rw_fix with 300s (1) cores
% 0.38/0.63 # post_as_ho8 with pid 9637 completed with status 0
% 0.38/0.63 # Result found by post_as_ho8
% 0.38/0.63 # Preprocessing class: HSLSSMSMSSSCHFA.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting lpo5_fix with 1500s (5) cores
% 0.38/0.63 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.38/0.63 # Starting post_as_ho8 with 300s (1) cores
% 0.38/0.63 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.38/0.63 # Search class: HGUSM-FFMF33-SHFFFSNN
% 0.38/0.63 # partial match(3): FGUSM-FFMF33-SFFFFFNN
% 0.38/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.63 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 163s (1) cores
% 0.38/0.63 # G-E--_215_C46_F1_AE_CS_SP_PS_S2S with pid 9645 completed with status 0
% 0.38/0.63 # Result found by G-E--_215_C46_F1_AE_CS_SP_PS_S2S
% 0.38/0.63 # Preprocessing class: HSLSSMSMSSSCHFA.
% 0.38/0.63 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.63 # Starting lpo5_fix with 1500s (5) cores
% 0.38/0.63 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.38/0.63 # Starting post_as_ho8 with 300s (1) cores
% 0.38/0.63 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.38/0.63 # Search class: HGUSM-FFMF33-SHFFFSNN
% 0.38/0.63 # partial match(3): FGUSM-FFMF33-SFFFFFNN
% 0.38/0.63 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.63 # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 163s (1) cores
% 0.38/0.63 # Preprocessing time : 0.004 s
% 0.38/0.63 # Presaturation interreduction done
% 0.38/0.63
% 0.38/0.63 # Proof found!
% 0.38/0.63 # SZS status Theorem
% 0.38/0.63 # SZS output start CNFRefutation
% See solution above
% 0.38/0.63 # Parsed axioms : 454
% 0.38/0.63 # Removed by relevancy pruning/SinE : 361
% 0.38/0.63 # Initial clauses : 140
% 0.38/0.63 # Removed in clause preprocessing : 11
% 0.38/0.63 # Initial clauses in saturation : 129
% 0.38/0.63 # Processed clauses : 7
% 0.38/0.63 # ...of these trivial : 1
% 0.38/0.63 # ...subsumed : 0
% 0.38/0.63 # ...remaining for further processing : 6
% 0.38/0.63 # Other redundant clauses eliminated : 0
% 0.38/0.63 # Clauses deleted for lack of memory : 0
% 0.38/0.63 # Backward-subsumed : 0
% 0.38/0.63 # Backward-rewritten : 2
% 0.38/0.63 # Generated clauses : 0
% 0.38/0.63 # ...of the previous two non-redundant : 1
% 0.38/0.63 # ...aggressively subsumed : 0
% 0.38/0.63 # Contextual simplify-reflections : 0
% 0.38/0.63 # Paramodulations : 0
% 0.38/0.63 # Factorizations : 0
% 0.38/0.63 # NegExts : 0
% 0.38/0.63 # Equation resolutions : 0
% 0.38/0.63 # Disequality decompositions : 0
% 0.38/0.63 # Total rewrite steps : 3
% 0.38/0.63 # ...of those cached : 0
% 0.38/0.63 # Propositional unsat checks : 0
% 0.38/0.63 # Propositional check models : 0
% 0.38/0.63 # Propositional check unsatisfiable : 0
% 0.38/0.63 # Propositional clauses : 0
% 0.38/0.63 # Propositional clauses after purity: 0
% 0.38/0.63 # Propositional unsat core size : 0
% 0.38/0.63 # Propositional preprocessing time : 0.000
% 0.38/0.63 # Propositional encoding time : 0.000
% 0.38/0.63 # Propositional solver time : 0.000
% 0.38/0.63 # Success case prop preproc time : 0.000
% 0.38/0.63 # Success case prop encoding time : 0.000
% 0.38/0.63 # Success case prop solver time : 0.000
% 0.38/0.63 # Current number of processed clauses : 4
% 0.38/0.63 # Positive orientable unit clauses : 4
% 0.38/0.63 # Positive unorientable unit clauses: 0
% 0.38/0.63 # Negative unit clauses : 0
% 0.38/0.63 # Non-unit-clauses : 0
% 0.38/0.63 # Current number of unprocessed clauses: 123
% 0.38/0.63 # ...number of literals in the above : 339
% 0.38/0.63 # Current number of archived formulas : 0
% 0.38/0.63 # Current number of archived clauses : 2
% 0.38/0.63 # Clause-clause subsumption calls (NU) : 0
% 0.38/0.63 # Rec. Clause-clause subsumption calls : 0
% 0.38/0.63 # Non-unit clause-clause subsumptions : 0
% 0.38/0.63 # Unit Clause-clause subsumption calls : 0
% 0.38/0.63 # Rewrite failures with RHS unbound : 0
% 0.38/0.63 # BW rewrite match attempts : 2
% 0.38/0.63 # BW rewrite match successes : 2
% 0.38/0.63 # Condensation attempts : 0
% 0.38/0.63 # Condensation successes : 0
% 0.38/0.63 # Termbank termtop insertions : 14918
% 0.38/0.63 # Search garbage collected termcells : 6377
% 0.38/0.63
% 0.38/0.63 # -------------------------------------------------
% 0.38/0.63 # User time : 0.012 s
% 0.38/0.63 # System time : 0.008 s
% 0.38/0.63 # Total time : 0.020 s
% 0.38/0.63 # Maximum resident set size: 3428 pages
% 0.38/0.63
% 0.38/0.63 # -------------------------------------------------
% 0.38/0.63 # User time : 0.026 s
% 0.38/0.63 # System time : 0.012 s
% 0.38/0.63 # Total time : 0.038 s
% 0.38/0.63 # Maximum resident set size: 2752 pages
% 0.38/0.63 % E---3.1 exiting
% 0.38/0.63 % E exiting
%------------------------------------------------------------------------------